Random walk with jumps in large-scale random geometric graphs
نویسندگان
چکیده
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30 210 727 5341; fax: +30 210 727 5333. E-mail addresses: [email protected] (L. Tzevelekas), ok [email protected] (I. Stavrakakis).
منابع مشابه
Random Walks with Jumps in Wireless Sensor Networks
Random Walks have been proposed for information dissemination/discovery in Wireless Sensor Networks. In this work we propose the Random Walk with Jumps model as an improvement on the Random Walk without Jumps for sparse graphs. Our proposal features the incorporation of ’jumps’ (with random direction and length) in the otherwise simple random walk movement throughout the graph of sensor nodes. ...
متن کاملSampling Online Social Networks by Random Walk with Indirect Jumps
Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph is loosely connected, which results in poor estimation accuracy. Random walk with jumps (RWwJ) can address the slow mixing problem but it is inapplicable if the graph does not support uniform vertex sampling (UNI). In ...
متن کاملEfficient collection of sensor data via a new accelerated random walk
Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases ...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملEfficient algorithms for topology control and information dissemination/ retrieval in large scale Wireless Sensor Networks
Wireless Sensor Networks (WSNs) require radically new approaches for protocol/ algorithm design, with a focus towards energy efficiency at the node level. We propose two algorithms for energy-efficient, distributed clustering called Directed Budget Based (DBB) and Directed Budget Based with Random Delays (DBB-RD). Both algorithms improve clustering performance and overall network decomposition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 33 شماره
صفحات -
تاریخ انتشار 2010